Balanced Network Flows ( IV )
نویسندگان
چکیده
منابع مشابه
Balanced network flows. IV. Duality and structure theory
The present paper continues our study of balanced network flows and general matching problems [2, 3, 4]. Problems of finding maximum matchings, minimumdeficiency matchings, and even factors of graphs have dual formulations by so-called odd cuts. Minimum– maximum results have been derived for various matching problems. However, statements in terms of generalized matching problems are far less in...
متن کاملBalanced network flows. V. Cycle-canceling algorithms
The present paper continues our study of balanced network flows and general matching problems [6–9]. Beside the techniques presented in these papers, there is a further strategy to obtain maximum balanced flows. This approach is due to Anstee [2] and results in state-of-theart algorithms for capacitated matching problems. In contrast to the balanced augmentation algorithm and the scaling method...
متن کاملBalanced network flows. VI. Polyhedral descriptions
This paper discusses the balanced circulation polytope, that is, the convex hull of balanced circulations of a given balanced flow network. The LP description of this polytope is the LP description of ordinary circulations plus some odd-set constraints. The paper starts with an exposition of several classes of odd-set inequalities. These inequalities are described in terms of balanced network f...
متن کاملBalanced Network Flows
Let G be a simple, undirected graph. A special network N, called a balanced network, is constructed from G such that maximum matchings and f-factors in G correspond to maximum flows in N. A max-balancedflow-min-balanced-cut theorem is proved for balanced networks. It is shown that Tutte’s Factor Theorem is equivalent to this network flow theorem, and that f-barriers are equivalent to minimum ba...
متن کاملImproved Balanced Flow Computation Using Parametric Flow
We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires O(n) maxflow computations, where n is the number of nodes in the network [Devanur et al. 2008]. Our algorithm requires only a single parametric flow computation. The best algorithm for computin...
متن کامل